The hare and the tortoise: the network structure of exploration and exploitation

نویسندگان

  • David Lazer
  • Allan Friedman
چکیده

We found a curvilinear relationship between density and final score. Moderately low density measures (p=.04-6) outperformed very low density graphs and higher density graphs. Graphs with very low density often contain isolated cliques that reduce average score. If all nodes are not connected, then they cannot share the best solution found, lowering the optimal score. Eliminating all multi-clique networks confirms a negative (monotonic) relationship between network density and average long-term solution. Since average path length is negatively correlated with density, this supports the hypothesis that higher scores are a function of higher distance between nodes. Random Networks (Erdos-Renyi) Results: Linear vs. full networks

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective Grasshopper Optimization Algorithm based Reconfiguration of Distribution Networks

Network reconfiguration is a nonlinear optimization procedure which calculates a radial structure to optimize the power losses and improve the network reliability index while meeting practical constraints. In this paper, a multi-objective framework is proposed for optimal network reconfiguration with the objective functions of minimization of power losses and improvement of reliability index. T...

متن کامل

The parable of the hare and the tortoise: Network

Networks provide the architecture of systemic adaptation. In any social system, the units of that system seek success—whether those criteria for success are determined by evolutionary processes or by (boundedly rational) goal-seeking processes. Networks provide the architecture of success in social systems because information about success that flows through the network provides one of the prim...

متن کامل

An Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems

Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...

متن کامل

OPTIMIZATION OF AN OFFSHORE JACKET-TYPE STRUCTURE USING META-HEURISTIC ALGORITHMS

Offshore jacket-type towers are steel structures designed and constructed in marine environments for various purposes such as oil exploration and exploitation units, oceanographic research, and undersea testing. In this paper a newly developed meta-heuristic algorithm, namely Cyclical Parthenogenesis Algorithm (CPA), is utilized for sizing optimization of a jacket-type offshore structure. The a...

متن کامل

Question answer relationship strategy increases reading comprehension among Kindergarten students

The  Question  Answer  Relationship  (QAR)  strategy  equips  students  with  tools  to  successfully decode and comprehend what they read. An action research project over 18 days with twenty-three kindergarteners adapted exposure to QAR’s “In the Book” and “In my Head” categories with similar questions for each of two popular Aesop’s fables. The challenges and outcomes are  presented  with  sp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005